//
//  RBTree.cpp
//  RedBlackTree
//
//  Created by 卜绎皓 on 2022/11/17.
//

#include "RBTree.hpp"
#include<stdlib.h>
 
void TestRBTree()
{
    //int a[] = { 16, 3, 7, 11, 9, 26, 18, 14, 15 };
    int a[] = { 4, 2, 6, 1, 3, 5, 15, 7, 16, 14 };
    RBTree<int, int> t;
    for (auto& e: a)
    {
        t.Insert(make_pair(e, e));
    }
 
    t.InOrder();
    cout << t.CheckBlance() << endl;
}
 
int main()
{
    TestRBTree();
 
    return 0;
}
